A CONTROL CHART FOR HEAVY TAILED DISTRIBUTIONS
نویسندگان
چکیده
منابع مشابه
Control Chart for Autocorrelated Processes with Heavy Tailed Distributions
Standard control charts are constructed under the assumption that the observations taken from the process of interest are independent over time; however, in practice the observations in many cases are actually correlated. This paper considers the problem of monitoring a process in which the observations can be represented as a first-order autoregressive model following a heavy tailed distributi...
متن کاملHeavy - Tailed Probability Distributions
Combinatorial search methods often exhibit a large variability in performance. We study the cost prooles of combinatorial search procedures. Our study reveals some intriguing properties of such cost prooles. The distributions are often characterized by very long tails or \heavy tails". We will show that these distributions are best characterized by a general class of distributions that have no ...
متن کاملHeavy - Tailed Distributions in CombinatorialSearchCarla
Combinatorial search methods often exhibit a large variability in performance. We study the cost prooles of combinatorial search procedures. Our study reveals some intriguing properties of such cost prooles. The distributions are often characterized by very long tails or \heavy tails". We will show that these distributions are best characterized by a general class of distributions that have no ...
متن کاملRare Events Simulation for Heavy{tailed Distributions
This paper studies rare events simulation for the heavy{tailed case, where some of the underlying distributions fail to have the exponential moments required for the standard algorithms for the light{tailed case. Several counterexamples are given to indicate that in the heavy{tailed case, there are severe problems with the approach of developing limit results for the conditional distribution gi...
متن کاملCollaborative Filtering and Heavy-Tailed Degree Distributions
Common techniques in collaborative filtering rely on finding low-rank matrix approximations to the adjacency matrix (ratings that users assign to items), essentially representing users and items as a collection of a small number of latent features. One issue that arises in many real world datasets for collaborative filtering is that the number of observed entries per row/column follows a heavy-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The South African Journal of Industrial Engineering
سال: 2009
ISSN: 1012-277X
DOI: 10.7166/20-2-763